\hypertarget{triangulation_8h}{
\section{triangulation.h File Reference}
\label{triangulation_8h}\index{triangulation.h@{triangulation.h}}
}
{\tt \#include \char`\"{}structures.h\char`\"{}}\par
\subsection*{Functions}
\begin{CompactItemize}
\item 
int \hyperlink{triangulation_8h_a04f8ece38fc315e7133875593523136}{triangulation\-Minimale} (\hyperlink{structGraphe}{Graphe} G)
\begin{CompactList}\small\item\em Cacul une triangulation minimale d'un graphe.. \item\end{CompactList}\end{CompactItemize}


\subsection{Function Documentation}
\hypertarget{triangulation_8h_a04f8ece38fc315e7133875593523136}{
\index{triangulation.h@{triangulation.h}!triangulationMinimale@{triangulationMinimale}}
\index{triangulationMinimale@{triangulationMinimale}!triangulation.h@{triangulation.h}}
\subsubsection[triangulationMinimale]{\setlength{\rightskip}{0pt plus 5cm}int triangulation\-Minimale (\hyperlink{structGraphe}{Graphe} {\em G})}}
\label{triangulation_8h_a04f8ece38fc315e7133875593523136}


Cacul une triangulation minimale d'un graphe.. 

Entree un \hyperlink{structGraphe}{Graphe} G=(S, A), sortie un graphe G==(S,A u B) triangule \begin{Desc}
\item[Author:]Bourgeois Jean-Louis \end{Desc}
\begin{Desc}
\item[Parameters:]
\begin{description}
\item[{\em $\ast$G}]un pointeur sur un \hyperlink{structGraphe}{Graphe} \end{description}
\end{Desc}
\begin{Desc}
\item[Returns:]Le nombre d'aretes ajoutees pour trianguler G ( card(B) ) \end{Desc}


Definition at line 261 of file triangulation.c.

References ajouter\-Arete\-Manquantes(), init\-Etiquette\-Tri(), Graphe::nb\-Sommets, Numerotation::Numero, selection\-Sommet\-Maximum(), and Numerotation::Sommet.

Referenced by main().